Numerical Analysis Reports SELF–SCALED BARRIER FUNCTIONS ON SYMMETRIC CONES AND THEIR CLASSIFICATION
نویسندگان
چکیده
Self–scaled barrier functions on self–scaled cones were introduced through a set of axioms in 1994 by Y. E. Nesterov and M. J. Todd as a tool for the construction of long–step interior point algorithms. This paper provides firm foundation for these objects by exhibiting their symmetry properties, their intimate ties with the symmetry groups of their domains of definition, and subsequently their decomposition into irreducible parts and algebraic classification theory. In a first part we recall the characterisation of the family of self–scaled cones as the set of symmetric cones and develop a primal–dual symmetric viewpoint on self-scaled barriers, results that were first discovered by the second author. We then show in a short, simple proof that any pointed, convex cone decomposes into a direct sum of irreducible components in a unique way, a result which can also be of independent interest. We then show that any self–scaled barrier function decomposes in an essentially unique way into a direct sum of self–scaled barriers defined on the irreducible components of the underlying symmetric cone. Finally, we present a complete algebraic classification of self–scaled barrier functions using the correspondence between symmetric cones and Euclidean Jordan algebras.
منابع مشابه
SELF { SCALED BARRIER FUNCTIONS ONSYMMETRIC CONES AND THEIR CLASSIFICATIONRaphael
Self{scaled barrier functions on self{scaled cones were introduced through a set of axioms in 1994 by Y. E. Nesterov and M. J. Todd as a tool for the construction of long{step interior point algorithms. This paper provides rm foundation for these objects by exhibiting their symmetry properties, their intimate ties with the symmetry groups of their domains of deenition, and subsequently their de...
متن کاملSelf-Scaled Barrier Functions: Decomposition and Classi cation
The theory of self-scaled conic programming provides a uniied framework for the theories of linear programming, semideenite programming and convex quadratic programming with convex quadratic constraints. Nesterov and Todd's concept of self-scaled barrier functionals allows the exploitation of algebraic and geometric properties of symmetric cones in certain variants of the barrier method applied...
متن کاملA New Self-Dual Embedding Method for Convex Programming
In this paper we introduce a conic optimization formulation for inequality-constrained convex programming, and propose a self-dual embedding model for solving the resulting conic optimization problem. The primal and dual cones in this formulation are characterized by the original constraint functions and their corresponding conjugate functions respectively. Hence they are completely symmetric. ...
متن کاملOn hyperbolicity cones associated with elementary symmetric polynomials
Elementary symmetric polynomials can be thought of as derivative polynomials of En(x) = ∏ i=1,...,n xi. Their associated hyperbolicity cones give a natural sequence of relaxations for R+. We establish a recursive structure for these cones, namely, that the coordinate projections of these cones are themselves hyperbolicity cones associated with elementary symmetric polynomials. As a consequence ...
متن کامل